Mechanism Design for Set Cover Games When Elements Are Agents
نویسندگان
چکیده
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets, i.e., being covered by some set. Each set is assumed to have a fixed cost. We develop several approximately efficient strategyproof mechanisms, each of which decides, after soliciting the declared bids by all elements, which elements will be covered, which sets will provide the coverage to these selected elements, and how much each element will be charged. For single-cover set cover games, we present a mechanism that is at least 1 dmax -efficient, i.e., the total valuation of all selected elements is at least 1 dmax fraction of the total valuation produced by any mechanism. For multi-cover set cover games, we present a budget-balanced strategyproof mechanism that is
منابع مشابه
Mechanism design for set cover games with selfish element agents
In this paper we study the set cover games when the elements are selfish agents, each of which has a privately known valuation of receiving the service from the sets, i.e., being covered by some set. Each set is assumed to have a fixed cost. We develop several approximately efficient strategyproof mechanisms that decide, after soliciting the declared bids by all elements, which elements will be...
متن کاملCost Sharing and Strategyproof Mechanisms for Set Cover Games
We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, in the core, and/or group-strategyproof. We first study the cost sharing for a single set cover game, which does not have a budgetbalanced mechanism in the core. We show that there is no cost allocation method that can always recover more than 1 ln n of the total cost and in the core. Her...
متن کاملAlgorithm Instance Games
This paper introduces algorithm instance games (AIGs) as a conceptual classification applying to games in which outcomes are resolved from joint strategies algorithmically. For such games, a fundamental question asks: How do the details of the algorithm’s description influence agents’ strategic behavior? We analyze two versions of an AIG based on the set-cover optimization problem. In these gam...
متن کاملRelationship between Designing Computer-based Educational Games, and Learning Motivation among Elementary Students
Background: Motivation is an important factor in learning. Educational games increase the learning motivation and understanding of students by creating a sense of joy, satisfaction and involvement. However, it is necessary to incorporate learning elements into the games, differently. In this study, the researcher tried to provide a model for designing educational games and determining its relat...
متن کاملStrategies in Games: A Logic-Automata Study
Overview. There is now a growing body of research on formal algorithmic models of social procedures and interactions between rational agents. These models attempt to identify logical elements in our day-to-day social activities. When interactions are modeled as games, reasoning involves analysis of agents’ long-term powers for influencing outcomes. Agents devise their respective strategies on h...
متن کامل